path distanceの例文

• With a single " hop, " path distances up to 3500 km may be reached.
• This algorithm is not solely interested in reachability as it also computes the shortest path distance between all pairs of vertices.
• Someone passing by Michelson-Morley's apparatus near the speed of light would not describe the apparatus as having equal light path distances.
• Thus, doubling the propagation path distance from the transmitter reduces each of their received field strengths over a free-space path by one-half.
• It shares several design goals with the Dvorak layout, such as minimizing finger path distance and making heavy use of the home row.
• There are a number of techniques than could potentially be used to derive the direct path distance between the local loudspeaker and the local microphone.
• This algorithm therefore expands outward from the starting point, interactively considering every node that is closer in terms of shortest path distance until it reaches the destination.
• The characteristics of this device are attributable to the relationship between the physical size of the unit, in particular the air path distance, and the spacing of the plates.
• The metric closure of a graph " G " is the complete graph in which each edge is weighted by the shortest path distance between the nodes in " G ".
• Straight-path distances between many locations worldwide can be determined online at www . indo . com / distance / or found in the book " Direct-Line Distances, " available at libraries and bookstores.
• Also, when a VHS-C cassette is inserted into the adapter, a small swing-arm pulls the tape out of the miniature cassette to span the standard tape path distance between the guide rollers of a full-size tape.
• As with median graphs more generally, squaregraphs are also partial cubes : their vertices can be labeled with binary strings such that the Hamming distance between strings is equal to the shortest path distance between vertices.
• In graph theory, a "'Ptolemaic graph "'is an undirected graph whose shortest path distances obey Ptolemy's inequality, which in turn was named after the distance-hereditary; they include the block graphs and are a subclass of the perfect graphs.
• Given a connected, undirected graph and a set of query vertices in a graph, the "'minimum Wiener connector "'is an induced subgraph that connects the query vertices and minimizes the sum of shortest path distances among all pairs of vertices in the subgraph.
• Klein, Mozes and Weimann gave an O ( " n " log 2 " n " )-time, linear-space algorithm to find the shortest path distances from " s " to all nodes for a directed planar graph with positive and negative arc-lengths containing no negative cycles.
• Each iteration of the main loop of the algorithm, after the first one, adds at least two edges to the set of edges whose relaxed distances match the correct shortest path distances : one from " E f " and one from " E b ".